Repetition Pattern Attack on Multi-word-containing SecureString 2.0 Objects
نویسنده
چکیده
Cloud computing appeals to private individuals and particularly enterprises at a progressive rate, but a noticeable percentage of them refuse it due to mistrust or missing commitment to security. The cryptosystem SecureString 2.0 was designed to outweigh these deficits through the support of blind computations on character strings. Repetition pattern attacks count among the most hazardous enemies of SecureString 2.0 objects because reoccurring ciphergrams within them may reveal linguistic identifying features of the correspondent plaintext. This paper analyzes and compares the success probability of repetition pattern attacks on the following three sorts of SecureString 2.0 objects: single-word-containing ones, multi-word-containing ones with a known number of words plus unknown delimiter positions, and multiword-containing ones with an unknown number of words plus unknown boundary locations. The latter type is expected to provide the highest privacy.
منابع مشابه
A Second View on SecureString 2.0
Many companies have thought about using external hosting solutions. Cloud computing as such a solution attracts prospective users who want to avoid initial costs and standing expenses with the underlying pay-as-you-use model. The outsourcing of sensitive information implies security risks, like eavesdropping and sabotage, for them as soon as they pass any unconfident area. If an outhouse hostin...
متن کاملSecureString 3.0 - A Cryptosystem for Blind Computing on Encrypted Character Strings
If (electronic) computations need to be undertaken, then mostly performance or commercial aspects lead to the selection for an optimal executing computer. In case the beneficiary of the computation upshots does not wholly confide in any computers except his ones, trust becomes his major decision criterion instead. Blind computing can do the trick to (re)win the beneficiary’s confidence. This pa...
متن کاملFinite repetition threshold for large alphabets
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest number r for which there exists an infinite r+-free word containing a finite number of r-powers. We show that there exists an infinite Dejean word on a 4-letter alphabet (i.e. a word without factors of exponent more than 7 5 ) containing only two 7 5 -powers. For a 5-letter alphabet, we show that ...
متن کاملFeature-based Malicious URL and Attack Type Detection Using Multi-class Classification
Nowadays, malicious URLs are the common threat to the businesses, social networks, net-banking etc. Existing approaches have focused on binary detection i.e. either the URL is malicious or benign. Very few literature is found which focused on the detection of malicious URLs and their attack types. Hence, it becomes necessary to know the attack type and adopt an effective countermeasure. This pa...
متن کاملGlobal familiarity of visual stimuli affects repetition-related neural plasticity but not repetition priming
In this study, we tested the prediction of the component process model of priming [Henson, R.N. (2003). Neuroimaging studies of priming. Prog Neurobiol, 70 (1), 53-81] that repetition priming of familiar and unfamiliar objects produces qualitatively different neural repetition effects. In an fMRI study, subjects viewed four repetitions of familiar objects and globally unfamiliar objects with fa...
متن کامل